On Fixed Points of Permutations
نویسندگان
چکیده
The number of fixed points of a random permutation of {1, 2, . . . , n} has a limiting Poisson distribution. We seek a generalization, looking at other actions of the symmetric group. Restricting attention to primitive actions, a complete classification of the limiting distributions is given. For most examples, they are trivial – almost every permutation has no fixed points. For the usual action of the symmetric group on k-sets of {1, 2, . . . , n}, the limit is a polynomial in independent Poisson variables. This exhausts all cases. We obtain asymptotic estimates in some examples, and give a survey of related results. This paper is dedicated to the life and work of our colleague Manfred Schocker.
منابع مشابه
Sharply $(n-2)$-transitive Sets of Permutations
Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...
متن کاملThe largest and the smallest fixed points of permutations
We give a new interpretation of the derangement numbers dn as the sum of the values of the largest fixed points of all non-derangements of length n− 1. We also show that the analogous sum for the smallest fixed points equals the number of permutations of length n with at least two fixed points. We provide analytic and bijective proofs of both results, as well as a new recurrence for the derange...
متن کاملEnumeration of Derangements with Descents in Prescribed Positions
We enumerate derangements with descents in prescribed positions. A generating function was given by Guo-Niu Han and Guoce Xin in 2007. We give a combinatorial proof of this result, and derive several explicit formulas. To this end, we consider fixed point λ-coloured permutations, which are easily enumerated. Several formulae regarding these numbers are given, as well as a generalisation of Eule...
متن کاملStatistics on Pattern-avoiding Permutations
This thesis concerns the enumeration of pattern-avoiding permutations with respect to certain statistics. Our first result is that the joint distribution of the pair of statistics ‘number of fixed points’ and ‘number of excedances’ is the same in 321-avoiding as in 132-avoiding permutations. This generalizes a recent result of Robertson, Saracino and Zeilberger, for which we also give another, ...
متن کاملPermutations with extremal number of fixed points
Abstract. We extend Stanley’s work on alternating permutations with extremal number of fixed points in two directions: first, alternating permutations are replaced by permutations with a prescribed descent set; second, instead of simply counting permutations we study their generating polynomials by number of excedances. Several techniques are used: Désarménien’s desarrangement combinatorics, Ge...
متن کاملA Discontinuity in the Distribution of Fixed Point Sums
The quantity f(n, r), defined as the number of permutations of the set [n] = {1, 2, . . . n} whose fixed points sum to r, shows a sharp discontinuity in the neighborhood of r = n. We explain this discontinuity and study the possible existence of other discontinuities in f(n, r) for permutations. We generalize our results to other families of structures that exhibit the same kind of discontinuit...
متن کامل